An Interesting Gadget for Chain Pair Simplification
نویسنده
چکیده
In this paper we present an interesting gadget based on the chain pair simplification problem under the discrete Fréchet distance (CPS-3F), which allows the construction of arbitrarily long paths that must be chosen in the simplification of the two curves. A pseudopolynomial time reduction from set partition is given as an example. For clarification, CPS-3F was recently shown to be in P, and the reduction is merely to show how the gadget works.
منابع مشابه
Dwarf Frankenstein is still in your memory: tiny code reuse attacks
Code reuse attacks such as return oriented programming and jump oriented programming are the most popular exploitation methods among attackers. A large number of practical and non-practical defenses are proposed that differ in their overhead, the source code requirement, detection rate and implementation dependencies. However, a usual aspect among these methods is consideration of the common be...
متن کاملProtein Chain Pair Simplification Under the Discrete Fréchet Distance
For protein structure alignment and comparison, a lot of work has been done using RMSD as the distance measure, which has drawbacks under certain circumstances. Thus, the discrete Fréchet distance was recently applied to the problem of protein (backbone) structure alignment and comparison with promising results. For this problem, visualization is also important since protein chain backbones can...
متن کاملHigh-Quality Simplification with Generalized Pair Contractions
Because of its simplicity, the vertex pair contraction operation became very popular in mesh simplification. It allows for topological changes during simplification. In this paper we propose the use of the additional pair contractions of a vertex and an edge or a triangle and of two edges. The generalized contraction operations have several advantages over simple vertex pair contraction. They a...
متن کاملOn the General Chain Pair Simplification Problem
The Chain Pair Simplification problem (CPS) was posed by Bereg et al. who were motivated by the problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones. In this problem, given two polygonal chains of lengths n and m, the goal is to simplify both of them simultaneously, so that the lengths of the resulting simplifications as well as the dis...
متن کاملCoductometric studies of the interaction of acid green 25 with cationic alkyltrimethylammonium bromid surfactants
The interactions between an anionic dye, Acid Green 25 AG and the two cationic surfactants tetradecyltrimethylammonium bromide TTAB, and hexadecyltrimethylammonium bromide CTAB in aqueous solutions far below the CMC are studied using the conductometric method at different temperature. The equilibrium constants and other thermodynamic functions for the process of dye-surfactant ion pair formatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1607.06539 شماره
صفحات -
تاریخ انتشار 2016